Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
a |
→ g(c) |
| 2: |
|
g(a) |
→ b |
| 3: |
|
f(g(X),b) |
→ f(a,X) |
|
There are 3 dependency pairs:
|
| 4: |
|
A |
→ G(c) |
| 5: |
|
F(g(X),b) |
→ F(a,X) |
| 6: |
|
F(g(X),b) |
→ A |
|
The approximated dependency graph contains one SCC:
{5}.
-
Consider the SCC {5}.
The usable rules are {1,2}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006